Rank based cryptography : a credible post-quantum alternative to classical cryptography
نویسندگان
چکیده
In this paper we present rank-based cryptogra phy and discuss its interest relatively to other post-quantum families of cryptosystems like for in stance code (Hamming)-based cryptography or lattice (Euclidean)-based cryptography. We also survey re cent interesting results for this metric and show that rank based cryptography has many advantages and is a credible alternative to classical cryptography, when not so many alternatives are possible. In particular we present recent cryptosystems like the encryption LRPC scheme or the RankSign signature algorithm which are both fast algorithm with small size of key of only a few hundred bits. We also consider the secu rity of the general cryptographic problem, the Rank Decoding problem and highlights upcoming results on its security both theoretical and practical. Keys words: Public key cryptosystem, rank metric, error-correcting codes ∗ XLIM, Université de Limoges, 123,av. A. Thomas, 87000 Limoges, France. Email: [email protected] †XLIM, Université de Limoges, 123,av. A. Thomas, 87000 Limoges, France. Email: [email protected] ‡TelecomBrest, 29000 Brest, France. Email: [email protected] §INRIA Rocquencourt, projet SECRET, 78153 Le Chesnay, France. Email: [email protected] ¶Université Bordeaux, 351, av. de la Libération, 33405 Tal ence, France. Email: [email protected]
منابع مشابه
Entanglement versus Disentanglement: Quantum Cryptography
In alternative disentanglement based quantum cryptosystem, classical channel cannot be used when the system is protected by no-cloning principle. But for the similar security criterion , it is discussed that classical channel can be used in alternative entanglement based quantum cryptosystem. A prototype of conventional entanglement based cryptosystem is recovered from alternative entanglement ...
متن کاملEntanlged Vs Unentangled Based Alternative Quantum Cryptography
In alternative unentangled based cryptosystem, classical channel can not be used when the system is protected by no-cloning principle. But for the similar security criteria , it is shown that classical channel can be used in alternative entangled based quantum cryptosystem. A prototype of conventional entangled based cryptosystem is recovered from alternative entangled based cryptosystem, but s...
متن کاملThe Impact of Quantum Computing on Present Cryptography
The aim of this paper is to elucidate the implications of quantum computing in present cryptography and to introduce the reader to basic post-quantum algorithms. In particular the reader can delve into the following subjects: present cryptographic schemes (symmetric and asymmetric), differences between quantum and classical computing, challenges in quantum computing, quantum algorithms (Shor’s ...
متن کاملSecurity Bounds for the Design of Code-Based Cryptosystems
Code-based cryptography is often viewed as an interesting “Post-Quantum” alternative to the classical number theory cryptography. Unlike many other such alternatives, it has the convenient advantage of having only a few, well identified, attack algorithms. However, improvements to these algorithms have made their effective complexity quite complex to compute. We give here some lower bounds on t...
متن کاملPolynomial-Time Key Recovery Attack on the Faure-Loidreau Scheme based on Gabidulin Codes
Encryption schemes based on the rank metric lead to small public key sizes of order of few thousands bytes which represents a very attractive feature compared to Hamming metric-based encryption schemes where public key sizes are of order of hundreds of thousands bytes even with additional structures like the cyclicity. The main tool for building public key encryption schemes in rank metric is t...
متن کامل